Rendezvous in Distributed Systems by Zhaoquan Gu Yuexuan Wang Qiang-Sheng Hua & Francis C. M. Lau

Author:Zhaoquan Gu, Yuexuan Wang, Qiang-Sheng Hua & Francis C. M. Lau
Language: eng
Format: epub
Publisher: Springer Singapore, Singapore

Case 6: . The situation is different from case 5 because when , user A is in the base stage and rendezvous may not happen. It is akin to case 2 that they can achieve rendezvous in the i-th frame where in time slots, as in Fig. 9.6f.

Combining the six situations, rendezvous for port-symmetric users can be achieved in time slots.

Similarly, we derive the time complexity to achieve rendezvous for two asymmetric users as follows.

Theorem 9.3

LS algorithm (Algorithm 9.1) guarantees rendezvous in time slots for two port-asymmetric users.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.